A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming
نویسندگان
چکیده
This note establishes a new sufficient condition for the existence and uniqueness of the Alizadeh-Haebedy-Overton direction for semidefinite programming, t~) 1997 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.
منابع مشابه
A Note on the Local Convergence of a Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Based on the Alizadeh--Haeberly--Overton Search Direction
This note points out an error in the local quadratic convergence proof of the predictorcorrector interior-point algorithm for solving the semidefinite linear complementarity problem based on the Alizadeh–Haeberly–Overton search direction presented in [M. Kojima, M. Shida, and S. Shindoh, SIAM J. Optim., 9 (1999), pp. 444–465]. Their algorithm is slightly modified and the local quadratic converg...
متن کاملThe Q Method for the Second-Order Cone Programming
In this paper we present a new algorithm for solving the second order cone programming problems which we call the Q method. This algorithm is an extension of the Q method of Alizadeh Haeberly and Overton for the semidefinite programming problem.
متن کاملNonsymmetric Search Directions for Semidefinite Programming
Two nonsymmetric search directions for semideenite programming, the XZ and ZX search directions, are proposed. They are derived from a nonsymmetric formulation of the semideenite programming problem. The XZ direction corresponds to the direct linearization of the central path equation XZ = I; while the ZX direction corresponds to ZX = I. The XZ and ZX directions are well deened if both X and Z ...
متن کاملThe Q method for second order cone programming
We develop the Q method for the Second Order Cone Programming problem. The algorithm is the adaptation of the Q method for semidefinite programming originally developed by Alizadeh, Haeberly and Overton, [3] and [2]. We take advantage of the special algebraic structure associated with second order cone programs to formulate the Q method. Furthermore we prove that our algorithm is globally conve...
متن کاملPolynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions
This paper establishes the polynomialconvergence of the class of primal-dualfeasible interior-point algorithms for semideenite programming (SDP) based on Monteiro and Zhang family of search directions. In contrast to Monteiro and Zhang's work, no condition is imposed on the scaling matrix that determines the search direction. We show that the polynomial iteration-complexity bounds of two well-k...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 77 شماره
صفحات -
تاریخ انتشار 1997